Efficient Lagrangian particle tracking algorithms for distributed-memory architectures

Efficient and Scalable Algorithms for Smoothed Particle Hydrodynamics on Hybrid Shared/Distributed-Memory Architectures

This paper describes a new fast and implicitly parallel approach to neighbour-finding in multi-resolution Smoothed Particle Hydrodynamics (SPH) simulations. This new approach is based on hierarchical cell decompositions and sorted interactions, within a task-based formulation. It is shown to be faster than traditional tree-based codes, and to scale better than domain decomposition-based approac...

Low-cost scheduling algorithms for distributed-memory architectures

One of the main problems in the field of scheduling algorithms for distributed memory systems is finding heuristics that produce good schedules at a low cost. We propose two new approaches for the scheduling problem. Both algorithms are intended to be used at compile time, to schedule task graphs on a distributed systems. Compared to known scheduling algorithms, the proposed algorithms preserve...

CASS: an efficient task management system for distributed memory architectures

The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the application characteristics. On the other hand, the task of limiting the parallelism in a chosen parallel algorithm is best handled b y the compiler or operating system for the target MPP machine. Toward this end, we have dev...

Compiling for Distributed Memory Architectures

Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures

Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim’s and Kruskal’s algorithm and present their parallelization targeting message passing parallel machine with distributed memory. We consider large graphs that can not fit into memory of one process. Experimental results show that Prim’s algorithm i...